Characterizing local best SAIN approximations

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Best subspace tensor approximations

In many applications such as data compression, imaging or genomic data analysis, it is important to approximate a given tensor by a tensor that is sparsely representable. For matrices, i.e. 2-tensors, such a representation can be obtained via the singular value decomposition which allows to compute the best rank k approximations. For t-tensors with t > 2 many generalizations of the singular val...

متن کامل

The best Diophantine approximations: the

This brief survey deals with multi-dimensional Diophantine approximations in sense of linear form and with simultaneous Diophantine approximations. We discuss the phenomenon of degenerate dimension of linear sub-spaces generated by the best Diophantine approximations. Originally most of these results have been established by the author in [14, 15, 16, 17, 18]. Here we collect all of them togeth...

متن کامل

Best Approximations by Smooth Functions

THEOREM 1.1 (U. Sattes). Let r > 2 and g E C[O, l]\B$,‘. Then f”EB$’ is a best approximation to g, in L” (such a best approximation necessari/J) exisrs) if and only if there exists a subinterual (a, /?) c IO. 1 I and a positilse integer M > r + 1 for which the following conditions hold (i) f”l,n.ll, is a Perfect spline of degree r with exactly) M ~ r -1 knots arzd I.f”““(s)l = I a. e. on [u,pI....

متن کامل

Best approximations and porous sets

Let D be a nonempty compact subset of a Banach space X and denote by S(X) the family of all nonempty bounded closed convex subsets of X. We endow S(X) with the Hausdorff metric and show that there exists a set F ⊂ S(X) such that its complement S(X) \ F is σ-porous and such that for each A ∈ F and each x̃ ∈ D, the set of solutions of the best approximation problem ‖x̃− z‖ → min, z ∈ A, is nonempty...

متن کامل

Characterizing Conclusive Approximations by Logical Formulae

Considering an initial set of terms E, a rewriting relation R and a goal set of terms Bad, reachability analysis in term rewriting tries to answer to the following question: does there exists at least one term of Bad that can be reached from E using the rewriting relation R? Some of the approaches try to show that there exists at least one term of Bad reachable from E using the rewriting relati...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Approximation Theory

سال: 1982

ISSN: 0021-9045

DOI: 10.1016/0021-9045(82)90070-3